Monic Chebyshev pseudospectral differentiation matrices for higher-order IVPs and BVPs: applications to certain types of real-life problems
نویسندگان
چکیده
Abstract We introduce new differentiation matrices based on the pseudospectral collocation method. Monic Chebyshev polynomials (MCPs) were used as trial functions in (D-matrices). Those have been to approximate solutions of higher-order ordinary differential equations (H-ODEs). Two techniques will be this work. The first technique is a direct approximation H-ODE. While second depends transforming H-ODE into system lower order ODEs. discuss error analysis these D-matrices in-depth. Also, and truncation convergence presented improve analysis. Some numerical test examples are illustrated show constructed D-matrices’ efficiency accuracy.
منابع مشابه
Monic integer Chebyshev problem
We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let Mn(Z) denote the monic polynomials of degree n with integer coefficients. A monic integer Chebyshev polynomial Mn ∈ Mn(Z) satisfies ‖Mn‖E = inf Pn∈Mn(Z) ‖Pn‖E . and the monic integer Chebyshev constant is then defined by tM (E) := lim n→∞ ‖Mn‖ E . This is the obvious analogue of the more usu...
متن کاملNumerical Solutions of Monic Chebyshev Polynomials on Large Scale Differentiation
In this paper, a new formula of the spectral differentiation matrices is presented. Therefore, the numerical solutions for higher-order differential equations are presented by expanding the unknown solution in terms of monic Chebyshev polynomials. The resulting systems of linear equations are solved directly for the values of the solution at the extreme points of the Chebyshev polynomial of ord...
متن کاملChebyshev pseudospectral collocation for parabolic problems with non- constant coefficients
This paper analyses a Chebyshev pseudospectral collocation semidiscrete (continuous in time) discretization of a variable coefficient parabolic problem. Optimal stability and convergence estimates are given. The analysis is based on an approximation property concerning the GaussLobatto-Chebyshev interpolation operator.
متن کاملMinimization problems for certain structured matrices
For given Z,B ∈ C, the problem of finding A ∈ C, in some prescribed class W , that minimizes ‖AZ − B‖ (Frobenius norm) has been considered by different authors for distinct classes W . Here, this minimization problem is studied for two other classes, which include the symmetric Hamiltonian, symmetric skew-Hamiltonian, real orthogonal symplectic and unitary conjugate symplectic matrices. The pro...
متن کاملThe operational matrix of fractional derivative of the fractional-order Chebyshev functions and its applications
In this paper, we introduce a family of fractional-order Chebyshev functions based on the classical Chebyshev polynomials. We calculate and derive the operational matrix of derivative of fractional order $gamma$ in the Caputo sense using the fractional-order Chebyshev functions. This matrix yields to low computational cost of numerical solution of fractional order differential equations to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2022
ISSN: ['1807-0302', '2238-3603']
DOI: https://doi.org/10.1007/s40314-022-01940-0